Skip to content
  • 0 Votes
    4 Posts
    330 Views
    zareenZ

    @zareen said in CS605 Assignment 3 Solution and Discussion:

    We have studied different software lifecycle models and project management techniques in this course. We have observed that various software application types require different software engineering models and techniques for their design and development.

  • 0 Votes
    2 Posts
    128 Views
    zareenZ

    @zareen said in CS406 Assignment 3 Solution and Discussion:

    CS406 Assignment 3 Solution and Discussion

    CS406 Assignment 3 Solution and Discussion

  • 0 Votes
    6 Posts
    228 Views
    zareenZ

    @zareen said in CS315 Assignment 3 Solution and Discussion:

    User run IDM (Internet Download Manager) application in the system then instead of execution, it creates multiple files in different portions of hard disk.

    Unlike the biological viruses that cause the common cold, people create … Despite the many variations of viruses, most have two phases to their execution: infection and delivery. … the Calculator, Notepad, Help, and other programs on the hard disk. The virus then scans the computer to locate .exe files on other drives and …
    Reff

  • 0 Votes
    2 Posts
    421 Views
    zareenZ

    Ideas Solution!

  • 0 Votes
    2 Posts
    104 Views
    zareenZ

    Please share Idea Solution:

  • 0 Votes
    1 Posts
    89 Views
    No one has replied
  • 0 Votes
    48 Posts
    2k Views
    zareenZ

    The FIRST of a sentential form is the set of terminal symbols that lead any sentential from derived from the very first sentential form. In this particular case X and Y only derive the empty string and as a result the empty string is the FIRST set of both non-terminal symbols X and Y. The FIRST of S, however, includes “a” as in the first production once can derive a sentential form that starts with an “a” given that X can be replaced by the empty string. X similar reasoning allows you to include “b” in the FIRST(S).
    summary: FIRST(X) = {e}, FIRST(Y) = {e}, FIRST(S) = {a, b}

    The FOLLOW set of a non-terminal symbol is the set of terminals that can appear after that non-terminal symbol in any sentential form derived from the grammar’s start symbol. By definition the follow of the start symbol will automatically include the $ sign which represents the end of the input string. In this particular case by looking at the productions of S one can determine right away that the follow of X includes the terminal “a” and “b” and that the FOLLOW of Y includes the terminal “b”. Given that the non-terminal S does not appear in any productions, not even in its own productions, the FOLLOW of S is only $.
    summary: FOLLOW(S) = {$}, FOLLOW(X) = {a, b}, FOLLOW(Y) = {b}.

    b) YES, because the intersection of the FIRST for every non-terminal symbol in empty. This leads to the parsing table for this LL method as indicated below. As there is no conflict in entry then grammar is clearly LL (1).
    [23/01, 21:33] Waqas Ahmad: a b $
    S S→XaXb S → Yb
    A X→ε X→ε
    B Y→ε

  • 0 Votes
    2 Posts
    730 Views
    zareenZ

    Q. 1 Solution Idea

    a. Final intensity of light is (0.4,0.7,0) +(0.2,0.1,0.5) +(-0.5, -0.6,0.5) +(-0.1, -
    0.2,0) = (0,0,1)

    b. Overall Contribution: id ⨂ cs = (0,0,1) ⨂ (0.5,0.7,0.8)
    = (0,0,0.8)

    c. Red and Green components will remain absent from the scene

    d. The object will look blue in the presence of light sources.

    Q. 2 Solution Idea:
    6ae1ea20-d477-4d0f-a273-454a23c93b08-image.png

  • 0 Votes
    2 Posts
    196 Views
    Aoune AhmadA

    ap k pas latest assgniment pas ha cs 432 ki aj xtended date ha plz help for cs subject

  • 0 Votes
    1 Posts
    118 Views
    No one has replied
  • 0 Votes
    2 Posts
    249 Views
    zareenZ

    Q. 1 Solution Idea
    41ecdd6f-9a08-42ae-8aef-8c8a7ae48e0e-image.png
    Q. 2 Solution Idea
    93ffe7fa-c211-42f1-ac78-ad09d1146033-image.png

  • 0 Votes
    3 Posts
    1k Views
    zareenZ

    Q. 1 Answer:

    Group client/server model

    The most suitable architecture model for this application is groupware client/server model. Because groupware server model is providing a set of application that enable communication among clients using text and images.

    Groupware are server based systems that support groups of people engaged in a common task and that provide an interface to a shared environment.

    Groupware client/server model is that which supports multiple users working on related tasks in local and remote networks. Group server is evolving concept that is more than just multiuser software which allows access to the same data.

    Groupware uses email, structured messages, agents , workflow, computer conferencing agents, file sharing systems among others. Groupware also makes problem-solving easier beacuse anyone in the team can make contributions.

    By analyzing the above mentioned system features and various system models we can choose groupware based system model. Because groupware server models work like team group. In the above case a company wants to develop an image scanner and editor applications for their office work. Office work like a team work.

    Ideas 2 Answer:

    Reading the above scenario, we can choose partitioning architecture technique. Because partitioning technique is a best suitable technique for distributing the responsibilities to different subsystems which will help in maintaining the software system.

    Partitioning can improve scalability, reduce contention, and optimize performance. It can also provide a mechanism for dividing data by usage pattern. For example, you can archive older data in cheaper data storage.

    Partitioning of architecture is an important concept. What we basically want to do is distribute the responsibilities to different subsystems so that we get a software system which is easy to maintain. Partitioning results in a system that suffers from fewer side effects. This ultimately means that we get a system that is easier to test and extend and hence is easier to maintain. A partition that divides a ship or plane into compartments.

    Screen. Partition consisting of a decorative frame or panel that serves to divide a space.

    Wall. An architectural partition with a height and length greater than its thickness; used to divide or enclose an area or to support another structure. Therefore, we can use the partitioning technique in the above Scenario. It is easy to use and maintain the system.

    Q. 2 Answer Idea

    class rightangletriangle{ constant int e = 3; // number of edges of the shape private: int a; // Length of Triangle height int b; // Length of triangle base public: float function1(){ // Method to calculate triangle area float z= (a*b)/2; // Formula for area calculation return z; } void function2(int x){ // method to set value for triangle height a = x; } void function3(int y){ // method to set value for triangle base b = x; } } ; Solution: Class TriangleRightAngle { constant int TOTAL_EDGES = ; private: int heightLengthMaximum; int baseLengthMaximum; public: float triangle AreaCalculate() { float wholeArea = (a*b)/2; return wholeArea; } void heightSetTriangle (int providedUserHeight){ heightLengthMaximum = providedUserheight; } void heightSetTriangle (int providedUserHeight){ baseLengthMaximum = providedUserbase; } };
  • 0 Votes
    1 Posts
    80 Views
    No one has replied
  • 0 Votes
    1 Posts
    114 Views
    No one has replied
  • 0 Votes
    4 Posts
    435 Views
    zareenZ

    Solution Idea!

    #include <bits/stdc++.h> using namespace std; class HeapNode_Min { // Tree node of Huffman public: //Add data members here. char d; unsigned f; HeapNode_Min *l, *r; HeapNode_Min(char d, unsigned f = -1) { //Complete the body of HeapNode_Min function this->d = d; this->f = f ; this->l = NULL; this->r = NULL; } }; class Analyze { // two heap nodes comparison public: bool operator()(HeapNode_Min* l, HeapNode_Min* r) { //add return before statement and statement is completed. return (l->f > r->f); //Complete this statement } }; void display_Codes(HeapNode_Min* root, string s) // To print codes of huffman tree from the root. { if (!root) return; if (root->d != '$') cout root->d "\t: " s "\n"; display_Codes(root->l, s + "0"); display_Codes(root->r, s + "1"); //Complete this statement by passing arguments } void HCodes(char data[], int freq[], int s) // builds a Huffman Tree { HeapNode_Min *t,*r, *l ; // top, right, left priority_queue<HeapNode_Min*, vector<HeapNode_Min*>, Analyze> H_min; int a=0; while (a<s){H_min.push(new HeapNode_Min(data[a], freq[a])); ++a;} while (H_min.size() != 1) { l = H_min.top(); H_min.pop(); r = H_min.top(); H_min.pop(); t = new HeapNode_Min('$', r->f + l->f); t->r = r; t->l = l; H_min.push(t); } display_Codes(H_min.top(), ""); } int main() { int frequency[] = { 3, 6, 11, 14, 18, 25 }; char alphabet[] = { 'A', 'L', 'O', 'R', 'T', 'Y' }; //Complete this statement by passing data type to both sizeof operators int size_of = sizeof(alphabet) / sizeof(*alphabet); cout"Alphabet"":""Huffman Code\n"; cout"--------------------------------\n"; //Call Huffman_Codes function. HCodes(alphabet, frequency, size_of); return 0; }
  • 0 Votes
    3 Posts
    247 Views
    zareenZ

    Q.184832e45-17d4-4808-abf1-2ddaa41877b9-image.png
    Q.2 0dbd1b6b-b277-41c3-a5da-c28fa809d82e-image.png